Corner Polyhedron and Intersection Cuts
نویسندگان
چکیده
Four decades ago, Gomory introduced the corner polyhedron as a relaxation of a mixed integer set in tableau form and Balas introduced intersection cuts for the corner polyhedron. A recent paper of Andersen, Louveaux, Weismantel and Wolsey has generated a renewed interest in the corner polyhedron and intersection cuts. We survey these two approaches and the recent developments in multi-row cuts. We stress the importance of maximal lattice-free convex sets and of the so-called infinite relaxation.
منابع مشابه
Equivalence between intersection cuts and the corner polyhedron
Intersection cuts were introduced by Balas and the corner polyhedron by Gomory. Balas showed that intersection cuts are valid for the corner polyhedron. In this paper we show that, conversely, every nontrivial facet-defining inequality for the corner polyhedron is an intersection cut.
متن کاملEvery Nontrivial Facet-Defining Inequality for the Corner Polyhedron is an Intersection Cut
Intersection cuts were introduced by Balas and the corner polyhedron by Gomory. It is a classical result that intersection cuts are valid for the corner polyhedron. In this paper we show that, conversely every nontrivial facet-defining inequality for the corner polyhedron is an intersection cut.
متن کاملConstant factor approximations with families of intersection cuts
We study the problem of approximating the corner polyhedron using intersection cuts derived from families of lattice-free sets. In particular, we look that the problem of characterizing families that approximate the corner polyhedron up to a constant factor. The literature already contains several results in this direction. In this paper, we use the maximum number of facets of a lattice-free se...
متن کاملA geometric approach to cut-generating functions
The cutting-plane approach to integer programming was initiated more that 40 years ago: Gomory introduced the corner polyhedron as a relaxation of a mixed integer set in tableau form and Balas introduced intersection cuts for the corner polyhedron. This line of research was left dormant for several decades until relatively recently, when a paper of Andersen, Louveaux, Weismantel and Wolsey gene...
متن کاملSplit Closure and Intersection Cuts
In the seventies, Balas introduced intersection cuts for a Mixed Integer Linear Program (MILP), and showed that these cuts can be obtained by a closed form formula from a basis of the standard linear programming relaxation. In the early nineties, Cook, Kannan and Schrijver introduced the split closure of an MILP, and showed that the split closure is a polyhedron. In this paper, we show that the...
متن کامل